Coalitional manipulation of voting rules: simulations on empirical data

نویسندگان

چکیده

Using computer simulations based on empirical data, we show that seven voting rules call the IRV family (Instant-runoff voting, exhaustive ballot, Condorcet-IRV, Benham, Smith-IRV, Tideman and Woodall) are less sensitive to coalitional manipulation than a large selection of prominent rules. While relative performances these still deserve further investigation, differences at most marginal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules

Understanding the computational complexity of manipulation in elections is arguably the most central agenda in Computational Social Choice. One of the influential variations of the the problem involves a coalition of manipulators trying to make a favorite candidate win the election. Although the complexity of the problem is well-studied under the assumption that the voters are weighted, there w...

متن کامل

Coalitional Voting Manipulation: A Game-Theoretic Perspective

Computational social choice literature has successfully studied the complexity of manipulation in various voting systems. However, the existing models of coalitional manipulation view the manipulating coalition as an exogenous input, ignoring the question of the coalition formation process. While such analysis is useful as a first approximation, a richer framework is required to model voting ma...

متن کامل

Erratum: "bankruptcy Rules and Coalitional Manipulation"

In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents’ claims. We focus on the TAL-family of bankruptcy rules (MorenoTernero & Villar, 2006), a one-parameter family encompassing three classical rules: the Talmud (T ) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-fami...

متن کامل

Optimal manipulation of voting rules

Complexity of voting manipulation is a prominent research topic in computational social choice. The voting manipulation literature usually assumes that the manipulator is only concerned with improving the outcome of the election from her perspective. However, in practice, the manipulator may also be reluctant to lie, i.e., she may have a preference for submitting a vote that does not deviate to...

متن کامل

Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data

The study of voting systems often takes place in the theoretical domain due to a lack of large samples of sincere, strictly ordered voting data. We derive several million elections (more than all the existing studies combined) from a publicly available data, the Netflix Prize dataset. The Netflix data is derived from millions of Netflix users, who have an incentive to report sincere preferences...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constitutional Political Economy

سال: 2023

ISSN: ['1043-4062', '1572-9966']

DOI: https://doi.org/10.1007/s10602-022-09376-8